Within the last decade, there has been a dramatic bloom in ridesharing businesses along with the emergence of new enabling technologies. A central issue in ridesharing, which is also important in the general domain of cost-sharing in economics and computer science, is that the sharing of cost implies positive externalities and hence coordination problems for the network users. We investigate these problems experimentally in the present study. In particular, we focus on how sequential observability of transportation mode choices can be (...) a powerful facilitator of coordination in ridesharing. Our study abstracts the essential issues of coordination in ridesharing into a directed network game with experimentally testable predictions. In line with the theoretical analysis, our experimental evidence shows that even a limited extent of sequential choice observability might lead to efficient coordination. However, convergence to efficiency is slower with more limited observability, resulting in a significant increase in travel cost. (shrink)

We study the performance of heuristics relative to the performance of optimal solutions in the rich domain of sequential search, where the decision to stop the search depends only on the applicant’s relative rank. Considering multiple variants of the secretary problem, that vary from one another in their formulation and method of solution, we find that descriptive heuristics perform well only when the optimal solution prescribes a single threshold value. We show that a computational heuristic originally proposed as an approximate (...) solution to a single variant of the secretary problem performs equally well in many other variants where the optimal solution prescribes multiple threshold values that gradually relax the criterion for stopping the search. Finally, we propose a new heuristic with near optimal performance in a competitive or strategic variant of the secretary problem with multiple employers competing with one another to hire job applicants. Both heuristics share a simple computational component: the ratio of the number of interviewed applicants to the number of those remaining to be searched. We present the subgame-perfect Nash equilibrium for this competitive variant and an algorithm for its computation. (shrink)

We consider a class of dynamic tournaments in which two contestants are faced with a choice between two courses of action. The first is a riskless option (“hold”) of maintaining the resources the contestant already has accumulated in her turn and ceding the initiative to her rival. The second is the bolder option (“roll”) of taking the initiative of accumulating additional resources, and thereby moving ahead of her rival, while at the same time sustaining a risk of temporary setback. We (...) study this tournament in the context of a jeopardy race game (JRG), extend the JRG to $N > 2$ contestants, and construct its equilibrium solution. Compared to the equilibrium solution, the results of three experiments reveal a dysfunctional bias in favor of the riskless option. This bias is substantially mitigated when the contestants are required to commit in advance how long to pursue the risky course of action. (shrink)